Frustration with Fat Graphs
نویسنده
چکیده
We consider the effect of geometric frustration induced by the random distribution of loop lengths in the “fat” graphs of the dynamical triangulations model on coupled antiferromagnets. While the influence of such connectivity disorder is rather mild for ferromagnets in that an ordered phase persists and only the properties of the phase transition are substantially changed in some cases, any finite-temperature transition is wiped out due to frustration for some of the antiferromagnetic models. A wealth of different phenomena is observed: while for the annealed average of quantum gravity some graphs can adapt dynamically to allow the emergence of a Néel ordered phase, this is not possible for the quenched average, where a zerotemperature spin-glass phase appears instead. We relate the latter to the behaviour of conventional spin-glass models coupled to random graphs.
منابع مشابه
The bipartite edge frustration of hierarchical product of graphs
The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper our recent results on computing this quantity for hierarchical product of graphs are reported. We also present a fast algorithm for computing edge frustration index of (3, 6)−fullerene graphs.
متن کاملThe bipartite edge frustration of composite graphs
The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs. © 2010 Elsevier B.V. All rights reserved.
متن کاملBalance and Frustration in Signed Networks under Different Contexts
Frustration index is a key measure for analysing signed networks that has been underused due to its computational complexity. We use an optimisation-based method to analyse frustration as a global structural property of signed networks under different contexts. We provide exact numerical results on social and biological signed networks as well as networks of formal alliances and antagonisms bet...
متن کاملFat Hoffman graphs with smallest eigenvalue at least $-1-τ$
In this paper, we show that all fat Hoffman graphs with smallest eigenvalue at least −1−τ , where τ is the golden ratio, can be described by a finite set of fat (−1 − τ)-irreducible Hoffman graphs. In the terminology of Woo and Neumaier, we mean that every fat Hoffman graph with smallest eigenvalue at least −1−τ is anH-line graph, where H is the set of isomorphism classes of maximal fat (−1−τ)-...
متن کاملRelationship between social support and coping strategy and frustration tolerance in students of Shiraz University
People experience problems and frustration in their lives and should find proper mechanisms to cope with these difficulties. This study aimed to determine the relationship between social support and coping styles and frustration tolerance in students of Shiraz University. And this study examined the frustration tolerance according to coping styles and social support. The method of this study w...
متن کامل